On Approximating Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Large Finite Sets

نویسندگان

  • Nugroho Artadi Pujowidianto
  • Susan R. Hunter
  • Raghu Pasupathy
  • Loo Hay Lee
  • Chun-Hung Chen
چکیده

Nugroho Artadi Pujowidianto Department of Industrial and Systems Engineering, National University of Singapore, SINGAPORE, [email protected] Susan R. Hunter School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853, USA, [email protected] Raghu Pasupathy The Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA 24061, USA, [email protected] Loo Hay Lee Department of Industrial and Systems Engineering, National University of Singapore, SINGAPORE, [email protected] Chun-Hung Chen Systems Engineering and Operations Research, George Mason University, Fairfax, VA 22030, USA, [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets

Consider the context of selecting an optimal system from among a finite set of competing systems, based on a “stochastic” objective function and subject to multiple “stochastic” constraints. In this context, we characterize the asymptotically optimal sample allocation that maximizes the rate at which the probability of false selection tends to zero. Since the optimal allocation is the result of...

متن کامل

Multi-objective optimization of geometrical parameters for constrained groove pressing of aluminium sheet using a neural network and the genetic algorithm

One of sheet severe plastic deformation (SPD) operation, namely constrained groove pressing (CGP), is investigated here in order to specify the optimum values for geometrical variables of this process on pure aluminium sheets. With this regard, two different objective functions, i.e. the uniformity in the effective strain distribution and the necessary force per unit weight of the specimen, are...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

Global optimization using the asymptotically independent Markov sampling method

In this paper, we introduce a new efficient stochastic simulation method, AIMS-OPT, for approximating the set of globally optimal solutions when solving optimization problems such as optimal performance-based design problems. This method is based on Asymptotically Independent Markov Sampling (AIMS), a recently developed advanced simulation scheme originally proposed for Bayesian inference. This...

متن کامل

Global optimization for performance-based design using the Asymptotically Independent Markov Sampling Method

In this paper, we introduce a new efficient stochastic simulation method, AIMS-OPT, for approximating the set of globally optimal solutions when solving optimization problems such as optimal performance-based design problems. This method is based on Asymptotically Independent Markov Sampling (AIMS), a recently developed advanced simulation scheme originally proposed for Bayesian inference. Inst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012